integer sorting造句

例句与造句

1. The following table describes integer sorting algorithms and other sorting algorithms that are not comparison sorts.
2. Integer sorting algorithms including pigeonhole sort, counting sort, and radix sort are widely used and practical.
3. Integer sorting algorithms are usually designed to work in either the pointer machine or random access machine models of computing.
4. Different integer sorting algorithms make different assumptions, however, about whether integer multiplication is also allowed as a unit-time operation.
5. For points with integer coordinates the first part of the algorithm, sorting the points, can again be sped up by integer sorting.
6. It's difficult to find integer sorting in a sentence. 用integer sorting造句挺难的
7. Direct access is required, or at least valuable, in many algorithms such as binary search, integer sorting or certain versions of sieve of Eratosthenes.
8. Other integer sorting algorithms with smaller worst-case time bounds are not believed to be practical for computer architectures with 64 or fewer bits per word.
9. Integer sorting provides one of the six benchmarks in the DARPA High Productivity Computing Systems Discrete Mathematics benchmark suite, and one of eleven benchmarks in the NAS Parallel Benchmarks suite.
10. showed that in some cases the multiplications or table lookups required by some integer sorting algorithms could be replaced by customized operations that would be more easily implemented in hardware but that are not typically available on general-purpose computers . improved on this by showing how to replace these special operations by the bit field manipulation instructions already available on Pentium processors.
11. However, in models of computer arithmetic that allow numbers to be sorted more quickly than " O " ( " n " log " n " ) time, for instance by using integer sorting algorithms, planar convex hulls can also be computed more quickly : the Graham scan algorithm for convex hulls consists of a single sorting step followed by a linear amount of additional work.
12. Instead of using an integer priority queue in a sorting algorithm, it is possible to go the other direction, and use integer sorting algorithms as subroutines within an integer priority queue data structure . used this idea to show that, if it is possible to perform integer sorting in time per key, then the same time bound applies to the time per insertion or deletion operation in a priority queue data structure.
13. Instead of using an integer priority queue in a sorting algorithm, it is possible to go the other direction, and use integer sorting algorithms as subroutines within an integer priority queue data structure . used this idea to show that, if it is possible to perform integer sorting in time per key, then the same time bound applies to the time per insertion or deletion operation in a priority queue data structure.